Breadth-first heuristic search
نویسندگان
چکیده
منابع مشابه
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...
متن کاملBFHSP: A Breadth-First Heuristic Search Planner
Our Breadth-First Heuristic Search Planner (BFHSP) is a domain-independent STRIPS planner that finds sequential plans that are optimal with respect to the number of actions it takes to reach a goal. We developed BFHSP as part of our research on space-efficient graph search. It uses breadth-first search since we found that breadth-first search is more efficient than best-first search when divide...
متن کاملParallel Breadth-First Heuristic Search on a Shared-Memory Architecture
We consider a breadth-first approach to memory-efficient graph search and discuss how to parallelize it on a sharedmemory architecture that uses multithreading to achieve parallelism. The approach we develop for parallelizing breadthfirst search uses layer synchronization, in which threads expand all nodes in one layer of the breadth-first search graph before considering any nodes in the next l...
متن کاملExtended Breadth-First Search Algorithm
The task of artificial intelligence is to provide representation techniques for describing problems, as well as search algorithms that can be used to answer our questions. A widespread and elaborated model is state-space representation, which, however, has some shortcomings. Classical search algorithms are not applicable in practice when the state space contains even only a few tens of thousand...
متن کاملDepth/Breadth first search with applications
Given a graph G = (V,E) and a vertex u ∈ V , we would like to explore every vertex (and every edge) reachable from u. Let n = |V | and m = |E|. The graph may be directed or undirected. We will assume that the graph is given in its adjacency list representation (rather than adjacency matrix), i.e. for each vertex u, we have a linked list adj[u] of the neighbors of u (all vertices v such that (u,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2006
ISSN: 0004-3702
DOI: 10.1016/j.artint.2005.12.002